Non-classical preference models in combinatorial problems: Models and algorithms for graphs

This is a summary of the most important results presented in the author’s PhD thesis (Spanjaard, 2003). This thesis, written in French, was defended on 16 December 2003 and supervised by Patrice Perny. A copy is available from the author upon request. This thesis deals with the search for preferred solutions in combinatorial optimization problems (and more particularly graph problems). It aims at conciliating preference modelling and algorithmic concerns for decision aiding.